The modal predicate logics ${\bf PF}^*{\bf F}$.

On Kripke completeness of some modal predicate logics

Let us recall some basic definitions and notation; most of them are the same as in the book [3]. Atomic formulas are constructed from predicate letters P k (countably many for each arity n ≥ 0) and a countable set of individual variables V ar, without constants and function letters. Modal (predicate) formulas are obtained from atomic formulas by applying classical propositional connectives, qua...

Monadic Fuzzy Predicate Logics

Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to nite model property (properties) and arithmetical complexity of sets of tautologies, satis-able formulas and of analogous notion restricted to nite models.

Dynamic Modal Predicate Logic

On the Relative Expressiveness of Description Logics and Predicate Logics

It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in L̈3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which...

The Semantics of Modal Predicate Logic II. Modal Individuals Revisited

We continue the investigations begun in [10]. We shall define a semantics that is build on a new notion of frame, called coherence frames. In these frames, objects are transcendental (world–independent), as in the standard constant–domain semantics. This will remove the asymmetry between constants and variables of the counterpart semantics of [10]. We demonstrate the completeness of (general) c...